Translating from XML Schema to Relation Schema on Semantic Constraint 基于语义的XML模式到关系模式的转换
The application of define the candidate key of a relation schema 关于确定关系模式的候选码的研究
First, we discuss the method of describing Relation Data Schema in DTD and using ASP technique to translate data in Database Systems into XML documents; 首先,提出了用DTD描述关系数据模式和利用ASP技术转化数据库的数据成XML文档方法;
To turn generalization association ( Inheritance) into relation schema; 把泛化(继承)联系转换为关系模式;
To assign the multiplicity of association to relation schema; 把关联的多重性分配到关系模式中去;
A Polynomial-Time Algorithm to Find a Candidate Key of Minimum Cardinality on a Relation Schema 关系模式最小基数候选关键字多项式时间求解算法
The mistake in the proving process of the problem of deciding BCNF in reference is pointed out, and a polynomial time algorithm to decide whether a relation schema is in BCNF is given. 文中指出了文献〔1〕中对BCNF判定问题证明过程的错误之处,通过分析属于BCNF的关系模式的结构特点,给出了一个判定关系模式是否属于BCNF的多项式时间算法。
B_Schema can be directly mapped into relation schema. BSchema可以被直接映射为关系模式。
Following analysing the traits of the prime attribute in relation schema, an algorithm based on matrix to solve the prime problem is proposed in this paper. 本文从分析主属性在关系模式中的特点出发,在模式矩阵及其分类的基础上,给出了一个基于矩阵的关系模式主属性的判定算法。
We describe a knowledge base by relation schema and use the database method to store and manage the knowledge base, to improve the property of knowledge base management, and to surmount the limitation of which an expert system can not use knowledge base effectively. 本系统采用关系模式来描述知识库,用数据库方法存储管理知识库,以改善知识库的性能,克服专家系统不能有效地利用现有知识库的局限。
In the meanwhile, with using more accurate expres-sion of the avalanche excess noise factor, we give a relation schema between sensitivity and dark current. 同时,采用了较为精确的过剩噪声系数表达式,给出了灵敏度与暗电流的关系曲线。
In this paper, the theories and methods to simplify the relation schema with keeping equal candidate keys by successive elimination technologies are given. 本文研究了通过消元法将一个关系模式化成与之具有相同候选关键字的一组简单关系模式的理论和方法。
A Polynomial-time algorithm about finding all candidate keys of minimum cardinality relative to a relation schema 求关系模式所有最小基数候选关键字的一种多项式算法
In this paper, sufficient and necessary conditions of determining both hands meta primary attribute in a relation schema are found, and very avail algorithm for solving all both hands meta primary attribute in the relation schema are developed. 本文提出了确定关系模式中双元主属性的充要条件,开发了求解关系模式全部双元主属性的很有效的新算法。
Based on the analysis of the information characteristic of image database ( IDB) the general relation schema of IDB and the conception of Content_based Image Retrieval ( CBIR) were investigated, and then a set model of CBIR was introduced. 在分析图像数据库信息特征的基础上,讨论了图像数据库的一般关系模型和图像数据库基于内容查询的定义,提出了相应的集合代数模型,指出遥感图像基于内容查询实现的两种方案。
Based on the attributes relative table, an algorithm to find out all primary attributes of relation schema is proposed and an algorithm to find out all candidate keys of relation schema by means of composition of primary attributes is given. 在此基础上提出了用属性相关表求关系模式全部主属性的等级,并给出了用主属性来组合关系模式全部候选关键字的算法。
This paper brings forward a method of graphical standardization of relation schema based on function dependence diagram. 本文提出了一种以函数依赖图为基础的图示化关系模式规范化方法。
The Mapping process each element in DTD and mapping to an object schema. Then the object schema is mapped to the relation database schema. 映射的策略是以分析处理DTD中的每一个元素映射为对象模型,再由对象模型映射为数据库的关系模型。
In this paper, sufficient and necessary conditions of existing unique candidate key of the relation schema are found, and some rules for solving the candidate keys of single attribute function dependencies developed. 本文提出关系模式唯一候选关键字存在性的充要条件和开发了具有单属性函数依赖候选关键字的求解规则。
An algorithm to find all prime attributes of a relation schema based on the maximal relative block 基于最大相关块的关系模式全部主属性的一种解法
Based on the analysis of relation schema and XML Schema, It have completed reasonable effective relation schema to XML Schema pattern conversion algorithm. 通过对数据库关系模式和XMLSCHEMA分析,完成了合理有效的关系模式到XMLSCHEMA模式转换算法。
The constraints security layer consists of integrity constraints, classification and inference constraints, access constraints, and application semantics constraints. The adaptive detection layer consists of active database lev-el, relation schema level, transaction level and application semantics level. 将约束安全层分为完整性约束、分级和推理约束、访问约束和应用语义约束四个子层,将适应性检测层分为数据库活动级、关系模式级、事务级和应用语义级四个子层。
The thought of Normalization in Relational Data system is to eliminate the improprieties in Data Dependencies with steps, that is, to some extents, to partition the Relation Schema, as well as the principle of design patterns in schema, One Thing One Place. 关系数据理论中的规范化思想是逐步消除数据依赖中不合理的部分,使各关系模式达到某种程度的分离,即一事一地的模式设计原则。
The Relation Between Relevancy Degree and Decomposition of Relation Schema Meeting P_ ( BC) and No-α Ring 关联度与关系模式分解满足P(BC)且无α环的关系
A Polynomial_time Algorithm about Deciding the Prime Attribute Relative to a Relation Schema 关于关系模式主属性判定的一种多项式算法
Ontology is constructed by analyzing the primary key, attributes, reference relations, and integrity constraints of the ralation schema, and we give a set of mapping rules from the relation schema to concepts and hiberarchy of ontology. 通过分析关系模式的主键、属性、引用关系、完整性约束来创建本体,给出了一组框架逻辑描述的关系模式到本体概念和层次的映射规则。
Then, the method for transforming from the relation schema to XML Schema model is designed and implemented; a public model of the integration system is constructed. 设计实现了关系型数据库关系模式到XMLSCHEMA模式的转换方法,并建立该集成系统的公共模型。
And after extracting the relation schema information from relational databases, the relational schema information was written into an XML file. 2. The automatic constructing of initial ontology. 描述了如何从数据库中抽取出数据库的关系模式,并且把这些关系模式写入到了XML格式的关系模式文件中。2.初始本体的自动构建。
In addition, the relation schema is relatively stable and the candidate values for each attribute are limited. The new arrival data are only appended to the end of the current data area without updating exited data. 另外,这类数据的模式相对稳定,属性值域有限,新产生的数据只追加到当前数据末尾而不更新已有内容;并且在数据上的查询大多只与众多属性中的少数几个相关。
Compared to the existing conversion methods, this method maintains the integrity of relation schema maximumly and also its conversion and migration processes proceed without artificial participation. 相对于已有的转换方法,该方法在最大限度地保持关系模式的完整性的同时,转换和迁移过程无需人工参与,基于规则保证了转换过程的自动化。